for _ in range(int(input())):
user = input().split()
m,n = int(user[0]),int(user[1])
l=[]
temp=[]
result = "YES"
for i in range(2*m):
inp = input()
for j in inp:
temp.append(int(j))
l.append(temp)
temp = []
l_trans =[list(x) for x in zip(*l[:m])]
l_trans1 =[list(x) for x in zip(*l[m:])]
for i in range(m):
if (sum(l[i])%3)!=(sum(l[m+i])%3):
result = "NO"
break
for i in range(n):
if (sum(l_trans[i])%3)!=(sum(l_trans1[i])%3):
result = "NO"
break
print(result)
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |